Computing the lcs w.r.t. General EL+-TBoxes
نویسندگان
چکیده
Recently, exact conditions for the existence of the least common subsumer (lcs) computed w.r.t. general EL-TBoxes have been devised [13]. This paper extends these results and provides necessary and suffcient conditions for the existence of the lcs w.r.t. EL-TBoxes. We show decidability of the existence in PTime and polynomial bounds on the maximal role-depth of the lcs, which in turn yields a computation algorithm for the lcs w.r.t. EL-TBoxes.
منابع مشابه
Role-depth Bounded Least Common Subsumers by Completion for EL- and prob-EL-TBoxes
The least common subsumer (lcs) w.r.t general EL-TBoxes does not need to exists in general due to cyclic axioms. In this paper we present an algorithm for computing role-depth bounded EL-lcs based on the completion algorithm for EL. We extend this computation algorithm to a recently introduced probabilistic variant of EL: Prob-EL.
متن کاملCompletion-based computation of least common subsumers with limited role-depth for EL and Prob-EL
The least common subsumer (lcs) w.r.t general EL-TBoxes does not need to exists in general due to cyclic axioms. In this report we present an algorithm for computing role-depth bounded EL-lcs based on the completion algorithm for EL. We extend this computation algorithm to a recently introduced probabilistic variant of EL: Prob-EL.
متن کاملOptimizations for the Role-Depth Bounded Least Common Subsumer in EL+
Computing the least common subsumer (lcs) yields a generalization of a collection of concepts, computing such generalizations is a useful reasoning task for many ontology-based applications. Since the lcs need not exist, if computed w.r.t. general TBoxes, an approximative approach, the role-depth bounded lcs, has been proposed. Recently, this approach has been extended to the Description logic ...
متن کاملRole-depth Bounded Least Common Subsumers for EL+ and ELI
For EL the least common subsumer (lcs) need not exist, if computed w.r.t. general TBoxes. In case the role-depth of the lcs concept description is bounded, an approximate solution can be obtained. In this paper we extend the completion-based method for computing such approximate solutions to ELI and EL+. For ELI the extension needs to be able to treat complex node labels. For EL+ a naive method...
متن کاملComplexity of Subsumption in the EL Family of Description Logics: Acyclic and Cyclic TBoxes
We perform an exhaustive study of the complexity of subsumption in the EL family of lightweight description logics w.r.t. acyclic and cyclic TBoxes. It turns out that there are interesting members of this family for which subsumption w.r.t. cyclic TBoxes is tractable, whereas it is EXPTIME-complete w.r.t. general TBoxes. For other extensions that are intractable w.r.t. general TBoxes, we establ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013